A note on simplification orderings
نویسندگان
چکیده
منابع مشابه
Automatically Proving Termination Where Simplification Orderings Fail
To prove termination of term rewriting systems (TRSs), several methods have been developed to synthesize suitable well-founded or-derings automatically. However, virtually all orderings that are amenable to automation are so-called simpliication orderings. Unfortunately, there exist numerous interesting and relevant TRSs that cannot be oriented by orderings of this restricted class and therefor...
متن کاملText Simplification for Reading Assistance: A Project Note
This paper describes our ongoing research project on text simplification for congenitally deaf people. Text simplification we are aiming at is the task of offering a deaf reader a syntactic and lexical paraphrase of a given text for assisting her/him to understand what it means. In this paper, we discuss the issues we should address to realize text simplification and report on the present resul...
متن کاملA note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
Recently a number of variants of the approximate minimum degree algorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the performance of these variants on a range of problems and highlight their limitations. This leads us to propose a new variant that offers both speed and robustness.
متن کاملA Game on Partial Orderings
We study the determinacy of the game Gκ(A) introduced in [FuKoShe] for uncountable regular κ and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that Gκ(A) is undetermined. For the class of linear orders, the existence of such A depends on the size of κ. In particular we obtain a characterization of κ = κ in terms of determinacy of the game ...
متن کاملCanonical Orderings on Grids
Jump Point Search, an algorithm developed for fast search on uniform cost grids, has successfully improved the performance of grid-based search. But, the approach itself is actually a set of diverse ideas applied together. This paper decomposes the algorithm and gradually re-constructs it, showing the component pieces from which the algorithm is constructed. In this process, we are able to defi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1979
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90071-1